Efficient Variable Length Block Switching Mechanism
نویسندگان
چکیده
منابع مشابه
Efficient VLSI Architecture for Variable Length Block LMS Adaptive Filter
In this paper, we made an analysis on computational complexity of block least mean square (BLMS) finite impulse response (FIR) filter and decompose the filter computation into M sub-filters, where M = N/L, N is the filter length and L is the block-size. Each sub-filter acts like a short-length BLMS FIR filter of size L. The proposed decomposition scheme favors timemultiplexing the filtering com...
متن کاملPerformance comparison between fixed length switching and variable length switching
Fixed length switching (FLS) and variable length switching (VLS) are two main types of switching architecture in high-speed input-queued switches. FLS is based on a cell-by-cell scheduling algorithm, while VLS operates on the variable packet granularity. This paper aims to make a comprehensive comparison between these two switching modes to guide the industrial design and academic research. We ...
متن کاملEfficient Length Doubling From Tweakable Block Ciphers
We present a length doubler, LDT, that turns an n-bit tweakable block cipher into an efficient and secure cipher that can encrypt any bit string of length [n..2n − 1]. The LDT mode is simple, uses only two cryptographic primitive calls (while prior work needs at least four), and is a strong length-preserving pseudorandom permutation if the underlying tweakable block ciphers are strong tweakable...
متن کاملFixed-Length Packets versus Variable-Length Packets in Fast Packet Switching Networks
Fast Packet Switching (FPS) networks are designed to carry many kinds of traac, including voice, video, and data. In this paper, we evaluate one design parameter of FPS networks: whether the packets should be xed-length or variable-length. We consider three measures of performance: user frame loss rates, average latency, and eeective bandwidth.
متن کامل2.7 Perfectly Lossless Fixed-Length to Variable-Length Block Source Codes
To obtain lower rates than perfectly lossless FFB source codes, in Sections 2.5 and 2.6 we relaxed the perfectly lossless requirement and considered almost lossless FFB source codes. In this section we maintain the perfectly lossless requirement, but relax the FFB requirement — allowing the codewords to have different lengths — again with the goal of obtaining lower rates. Specifically, we cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2007
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2007.3.2359